Checking the strict positivity of Kraus maps is NP-hard

نویسندگان

  • Stéphane Gaubert
  • Zheng Qu
چکیده

Basic properties in Perron-Frobenius theory are strict positivity, primitivity, and irreducibility. Whereas for nonnegative matrices, these properties are equivalent to elementary graph properties which can be checked in polynomial time, we show that for Kraus maps the noncommutative generalization of stochastic matrices checking strict positivity (whether the map sends the cone to its interior) is NP-hard. The proof proceeds by reducing to the latter problem the existence of a non-zero solution of a special system of bilinear equations. The complexity of irreducibility and primitivity is also discussed in the noncommutative setting.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices

A matrix X is called completely positive if it allows a factorisation X = ∑ b∈B bb T with nonnegative vectors b. These matrices are of interest in optimisation, as it has been found that several combinatorial and quadratic problems can be formulated over the cone of completely positive matrices. The difficulty is that checking complete positivity is NP-hard. Finding a factorisation of a general...

متن کامل

Stable partitions in additively separable hedonic games

We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractually individually stable partition. This contrasts with previous results such as NP-hardness of computing individually stable or Nash stable partitions. Secondly, we prove that checking whether the core or the strict core exists...

متن کامل

Optimal Partitions in Additively Separable Hedonic Games

We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partition with maximum egalitarian or utilitarian social welfare is NP-hard in the strong sense whereas a Pareto optimal partition can be computed in polynomial time when preferences are strict. Perhaps surprisingly, checking...

متن کامل

ar X iv : q ua nt - p h / 05 06 09 5 v 1 1 3 Ju n 20 05 Schmidt states and positivity of linear maps

Using pure entangled Schmidt states, we show that m-positivity of a map is bounded by the ranks of its negative Kraus matrices. We also give an algebraic condition for a map to be m-positive. We interpret these results in the context of positive maps as entanglement witnesses, and find that only 1-positive maps are needed for testing entanglement.

متن کامل

Parameterized Complexity of Problems in Coalitional Resource Games

Coalition formation is a key topic in multi-agent systems. Coalitions enable agents to achieve goals that they may not have been able to achieve on their own. Previous work has shown problems in coalition games to be computationally hard. Wooldridge and Dunne (Artificial Intelligence 2006) studied the classical computational complexity of several natural decision problems in Coalitional Resourc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1402.1429  شماره 

صفحات  -

تاریخ انتشار 2014